Coherent Hierarchical Level-of-Detail (HLOD) Refinement Through Hardware Occlusion Queries

نویسنده

  • Jean Pierre Charalambos
چکیده

We present a coherent hierarchical level of detail (HLOD) culling algorithm that employs a novel metric to perform the refinement of a HLOD-based system that takes into account visibility information. The information is gathered from the result of a hardware occlusion query (HOQ) performed on the bounding volume of a given node in the hierarchy. Although the advantages of doing this are clear, previous approaches treat refinement criteria and HOQ as independent subjects. For this reason, HOQs have been used restrictively as if their result were boolean. In contrast to that, we fully exploit the results of the queries to be able to take into account visibility information within refinement conditions. We do this by interpreting the result of a given HOQ as the virtual resolution of a screen space where the refinement decision takes place. In order to be able to use our proposed metric to perform the refinement of the HLOD hierarchy as well as to schedule HOQs, we exploit the spatial and temporal coherence inherent to hierarchical representations. Despite the simplicity of our approach, in our experiments we obtained a substantial performance boost (compared to previous approaches) in the frame-rate with minimal loss in image

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HLOD Re nement Driven by Hardware Occlusion Queries

In order to achieve interactive rendering of complex models comprising several millions of polygons, the amount of processed data has to be substantially reduced. Level-ofdetail (LOD) methods allow the amount of data sent to the GPU to be aggressively reduced at the expense of sacri cing image quality. Hierarchical level-of-detail (HLOD) methods have proved particularly capable of interactive v...

متن کامل

Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful

We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries and reduces the delays due to the latency of query results. We reuse the results of occlusion queries from the last frame in order to initiate and schedule the queries in the next frame. This is done by processing nodes ...

متن کامل

Streaming HLODs: an out-of-core viewer for network visualization of huge polygon models

The constant growth of network and internet availability and speed as well as the increasing power of consumer level graphics hardware have created more and more interest in streaming transmission of three-dimensional data sets. However, since the size of such models is increasing even faster than the transmission or rendering bandwidth and has already exceeded the main memory available in comm...

متن کامل

CHC++: Coherent Hierarchical Culling Revisited

We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued occlusion queries and the number of ren...

متن کامل

CHC+RT: Coherent Hierarchical Culling for Ray Tracing

We propose a new technique for in-core and out-of-core GPU ray tracing using a generalization of hierarchical occlusion culling in the style of the CHC++ method. Our method exploits the rasterization pipeline and hardware occlusion queries in order to create coherent batches of work for localized shader-based ray tracing kernels. By combining hierarchies in both ray space and object space, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006